A Fog Computing Security: 2-Adic Complexity of Balanced Sequences

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Security Challenges in Fog Computing in Healthcare

Background and Aim: The Fog Computing is a highly virtualized platform that provides storage, computing and networking services between the Cloud data centers and end devices. Fog computing fits the characteristics of real-time health monitoring systems. In such systems, a large amount of data is acquired from a multitude of bio and environmental sensors. On the other hand, its distribution and...

متن کامل

Task Scheduling in Fog Computing: A Survey

Recently, fog computing has been introducedto solve the challenges of cloud computing regarding Internet objects. One of the challenges in the field of fog computing is the scheduling of tasks requested by Internet objects. In this study, a review of articles related to task scheduling in fog computing has been done. At first, the research questions and goals will be introduced, an...

متن کامل

Expected π-Adic Security Measures of Sequences

Various measures of security of stream ciphers have been studied that are based on the problem of finding a minimum size generator for the keystream in some special class of generators. These include linear and p-adic spans, as well as π-adic span, which is based on a choice of an element π in a finite extension of the integers. The corresponding sequence generators are known as linear feedback...

متن کامل

Security and Privacy Issues of Fog Computing: A Survey

Fog computing is a promising computing paradigm that extends cloud computing to the edge of networks. Similar to cloud computing but with distinct characteristics, fog computing faces new security and privacy challenges besides those inherited from cloud computing. In this paper, we have surveyed these challenges and corresponding solutions in a brief manner.

متن کامل

The 2-adic complexity of a class of binary sequences with almost optimal autocorrelation

Pseudo-random sequences with good statistical property, such as low autocorrelation, high linear complexity and large 2-adic complexity, have been used in designing reliable stream ciphers. In this paper, we obtain the exact autocorrelation distribution of a class of sequence with three-level autocorrelation and analyze the 2-adic complexity of this sequence. Our results show that the 2-adic co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Wireless Communications and Mobile Computing

سال: 2018

ISSN: 1530-8669,1530-8677

DOI: 10.1155/2018/7209475